Tableau-based Decision Procedures for Hybrid Logic
نویسندگان
چکیده
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very expressive hybrid logic including the universal modality; three of the procedures are based on different tableau systems, and one procedure is based on a Gentzen system. The decision procedures make use of so-called loop-checks which is a technique standardly used in connection with tableau systems for other logics, namely prefixed tableau systems for transitive modal logics, as well as prefixed tableau systems for certain description logics. The loop-checks used in our four decision procedures are similar, but the four proof systems on which the procedures are based constitute a spectrum of different systems: prefixed and internalized systems, tableau and Gentzen systems.
منابع مشابه
Terminating Tableau Systems for Hybrid Logic with Difference and Converse
This paper contributes to the principled construction of terminating tableau systems for modal logic with nominals and difference modalities [4, 1, 8, 11]. We also consider global and converse modalities and reflexive and transitive relations. Nominals and difference enrich modal logic with equational constraints, and handling these constraints in a terminating tableau system is the main challe...
متن کاملTermination for Hybrid Tableaus
This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Braüner [5]. Their paper gives tableau-based decision procedures for basic hybrid logic (with unary modalities) and the basic logic extended with the global modality. All their proof procedures make use of loop-checks to ensure termination. Here we take a closer look at termination for hybr...
متن کاملClausal Tableaux for Hybrid PDL
PDL (propositional dynamic logic) [6, 11, 8] is an expressive modal logic invented for reasoning about programs. It extends basic modal logic with expressions called programs. Programs describe relations from states to states and are used to express modalities. Programs are composed with the operators familiar from regular expressions. In addition, they may employ formulas so that conditionals ...
متن کاملFrom Tableau-based to Sat-based Procedures | Preliminary Report
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we showed that tableau-based procedures are intrinsically ineecient, and proposed an alternative approach of building decision procedures on top of SAT decision procedure. We called this approach \SAT-based". In extensive empirical tests on the case study of modal K, a SAT-based procedure drastically o...
متن کاملSAT-Based Decision Procedures for Normal Modal Logics: A Theoretical Framework
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we showed that tableau-based procedures are intrinsically ineecient, and proposed an alternative approach of building decision procedures on top of SAT decision procedure. We called this approach \SAT-based". In extensive empirical tests on the case study of modal K, a SAT-based procedure drastically o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 16 شماره
صفحات -
تاریخ انتشار 2006